Proof - of - Stake Research Seminar in Cryptography Janno

نویسندگان

  • Janno Siim
  • Michał Zając
چکیده

The key component in Bitcoin protocol (and many of the follow-up protocols) is the proof-of-work (PoW) puzzle solving. A miner can issue a new block only if it has solved a computationally difficult PoW challenge. In case of Bitcoin, miners need to find a hash of the previous block (by appending small nonce to it) that has a certain number of zeros in the beginning. The miner that finds it first can issue the next block and her work is rewarded in cryptocurrency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Party CRS Generation for a NIZK Shuffle Argument Research Seminar in Cryptography

Zero-knowledge (ZK) proof [GMR85] is a cryptographic technique where a prover P convinces a verifier V that a certain statement holds without revealing any other information. This can be done as an interactive protocol between P and V but in practice it is often convenient if the protocol is non-interactive (NIZK), meaning that P will send a single message π to V who then verifies it. This has ...

متن کامل

TwinsCoin: A Cryptocurrency via Proof-of-Work and Proof-of-Stake

We design and implement TwinsCoin, the €rst cryptocurrency based on a provably secure and scalable public blockchain design using both proof-of-work and proof-of-stake mechanisms. Di‚erent from the proof-ofwork based Bitcoin, our construction uses two types of resources, computing power and coins (i.e., stake). Œe blockchain in our system is more robust than that in a pure proof-of-work based s...

متن کامل

A new security proof for FMNV continuous non-malleable encoding scheme

A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

متن کامل

Cryptocurrencies Without Proof of Work

We study cryptocurrency protocols that do not make use of Proof of Work. Such protocols commonly rely on Proof of Stake, i.e. on mechanisms that extend voting power to the stakeholders of the system. We offer analysis of existing protocols that have a substantial amount of popularity. We then present our novel pure Proof of Stake protocols, and argue that the they help in mitigating problems th...

متن کامل

2-hop Blockchain: Combining Proof-of-Work and Proof-of-Stake Securely∗

Cryptocurrencies like Bitcoin have proven to be a phenomenal success. Bitcoin-like systems use proofof-work mechanism which is therefore considered as 1-hop blockchain, and their security holds if the majority of the computing power is under the control of honest players. However, this assumption has been seriously challenged recently and Bitcoin-like systems will fail when this assumption is b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017